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 listSep 17, 2026 16:42Andrew EpsteinAndrew EpsteinScore: 106,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:54106,288892,506,139881,194,0001,003,0002,117,632stderr
2Sep 17, 2026 16:54106,290892,511,905881,210,0001,002,0002,117,632stderr
3Sep 17, 2026 16:54106,536894,479,839883,247,0001,003,0002,117,632stderr
4Sep 17, 2026 16:54106,673895,690,971884,380,0001,007,0002,117,632stderr
5Sep 17, 2026 16:54106,685895,774,333884,464,0001,029,0002,117,632stderr
6Sep 17, 2026 16:54106,756896,305,284885,073,0001,005,0002,117,632stderr
7Sep 17, 2026 16:54106,999898,399,243887,093,0001,005,0002,117,632stderr
8Sep 17, 2026 16:54107,043898,824,558887,454,0001,007,0002,117,632stderr
9Sep 17, 2026 16:54107,204899,988,311888,792,0001,008,0002,117,632stderr