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 listDec 6, 2025 10:54Rajarshi BasuRajarshi BasuScore: 7,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 10:546,99691,630,18457,066,0001,001,0002,289,664
2Dec 6, 2025 10:547,09684,794,64156,899,0001,996,0002,277,376
3Dec 6, 2025 10:547,14086,095,70357,250,0002,008,0002,273,280
4Dec 6, 2025 10:547,17381,981,28658,526,0001,009,0002,289,664
5Dec 6, 2025 10:547,28285,548,35159,430,0001,007,0002,293,760
6Dec 6, 2025 10:547,30493,449,44559,612,0001,010,0002,281,472