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 listJun 4, 2025 03:47thatmagicalcatthatmagicalcatScore: 208,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 03:47208,3661,759,884,0101,727,437,0001,999,0002,281,472
2Jun 4, 2025 03:47208,4881,759,221,0091,729,449,000999,0002,285,568
3Jun 4, 2025 03:47208,4901,754,593,9651,730,468,00002,367,488
4Jun 4, 2025 03:47208,6131,756,246,7731,731,490,00002,281,472
5Jun 4, 2025 03:47208,7361,760,255,4231,731,508,000999,0002,363,392
6Jun 4, 2025 03:47208,8281,755,731,1921,731,270,0001,999,0002,453,504
7Jun 4, 2025 03:47208,9171,761,700,8571,732,016,0001,998,0002,285,568
8Jun 4, 2025 03:47208,9291,762,267,1951,732,115,0001,998,0002,281,472
9Jun 4, 2025 03:47211,3131,787,650,3091,752,898,000999,0002,281,472