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 listMay 10, 2026 02:54Josu San MartinJosu San MartinScore: 4,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:554,62255,572,88437,242,0001,121,0002,490,368
2May 10, 2026 02:554,62753,748,60637,235,0001,177,0002,322,432
3May 10, 2026 02:554,63255,727,51437,329,0001,117,0002,490,368
4May 10, 2026 02:554,67053,901,03537,740,0001,027,0002,322,432
5May 10, 2026 02:554,75857,084,45638,405,0001,092,0002,490,368
6May 10, 2026 02:554,77156,583,12538,449,0001,151,0002,490,368
7May 10, 2026 02:554,79556,079,87638,662,0001,141,0002,494,464
8May 10, 2026 02:554,84755,692,72439,087,0001,144,0002,482,176
9May 10, 2026 02:554,87758,532,43439,354,0001,127,0002,482,176