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 listJul 6, 2026 08:31Teow Hua JunTeow Hua JunScore: 10,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 08:3210,04092,732,30382,227,0001,108,0002,113,536
2Jul 6, 2026 08:3210,06092,884,49982,391,0001,107,0002,113,536
3Jul 6, 2026 08:3210,06392,934,68582,348,0001,179,0002,113,536
4Jul 6, 2026 08:3210,06692,985,02582,448,0001,107,0002,113,536
5Jul 6, 2026 08:3210,06693,032,36882,433,0001,119,0002,113,536
6Jul 6, 2026 08:3210,09093,111,36282,564,0001,187,0002,113,536
7Jul 6, 2026 08:3210,09993,196,22482,625,0001,203,0002,113,536
8Jul 6, 2026 08:3210,10193,216,02782,666,0001,175,0002,113,536
9Jul 6, 2026 08:3210,10593,386,63582,667,0001,205,0002,113,536