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 5, 2026 17:08Kevin HeaveyKevin HeaveyScore: 8,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:098,17377,384,09166,832,0001,010,0002,117,632
2Jul 5, 2026 17:098,38879,167,35768,418,0001,205,0002,117,632
3Jul 5, 2026 17:098,44479,638,32168,886,0001,201,0002,117,632
4Jul 5, 2026 17:098,47879,850,63269,155,0001,213,0002,117,632
5Jul 5, 2026 17:098,51080,135,62469,436,0001,197,0002,117,632
6Jul 5, 2026 17:098,52480,284,19469,553,0001,203,0002,117,632
7Jul 5, 2026 17:098,54980,544,81569,758,0001,202,0002,117,632
8Jul 5, 2026 17:098,55080,492,21269,740,0001,230,0002,117,632
9Jul 5, 2026 17:099,28686,887,00475,861,0001,218,0002,117,632