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 08:11Rajarshi BasuRajarshi BasuScore: 14,846Success
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 08:1114,468148,602,336106,077,00014,010,0002,473,984
2Dec 6, 2025 08:1114,846150,663,560112,199,00011,019,0002,473,984
3Dec 6, 2025 08:1115,053160,315,059110,951,00013,993,0002,506,752