Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 14, 2026 13:23marko1597marko1597Score: 171,697Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:23171,4141,432,683,1881,421,603,0001,137,0002,117,632stderr
2Aug 14, 2026 13:23171,4351,432,808,3211,421,755,0001,158,0002,117,632stderr
3Aug 14, 2026 13:23171,4771,434,069,7311,422,116,0001,146,0002,117,632stderr
4Aug 14, 2026 13:23171,6271,434,562,7231,423,349,0001,160,0002,117,632stderr
5Aug 14, 2026 13:23171,6971,434,855,5891,423,957,0001,131,0002,117,632stderr
6Aug 14, 2026 13:23171,8041,435,892,3751,424,858,0001,121,0002,117,632stderr
7Aug 14, 2026 13:23171,8351,445,502,8051,425,110,0001,123,0002,117,632stderr
8Aug 14, 2026 13:23171,9931,445,627,1661,426,407,0001,136,0002,117,632stderr
9Aug 14, 2026 13:23172,0551,437,966,5951,426,836,0001,224,0002,117,632stderr