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 listAug 2, 2026 14:47TonyTonyScore: 22,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:4821,558188,775,752167,040,00011,899,0002,113,536
2Aug 2, 2026 14:4822,035192,794,154170,974,00011,917,0002,113,536
3Aug 2, 2026 14:4822,111193,460,135171,733,00011,792,0002,113,536
4Aug 2, 2026 14:4822,151194,096,146171,665,00012,193,0002,113,536
5Aug 2, 2026 14:4822,296194,843,970173,111,00011,946,0002,113,536
6Aug 2, 2026 14:4822,427196,081,367174,115,00012,032,0002,113,536
7Aug 2, 2026 14:4822,470197,612,396174,253,00012,256,0002,113,536
8Aug 2, 2026 14:4822,745199,288,421176,885,00011,904,0002,113,536
9Aug 2, 2026 14:4823,377204,010,813181,344,00012,689,0002,113,536