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 listMar 1, 2026 21:21satoru.netsatoru.netScore: 41,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 21:2141,644375,512,101287,704,00057,940,0002,277,376
2Mar 1, 2026 21:2141,676368,506,952285,929,00059,985,0002,400,256
3Mar 1, 2026 21:2141,822374,181,712285,102,00062,022,0002,277,376