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 18, 2026 20:21wnwnScore: 4,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 20:214,25159,980,75234,276,0001,008,0002,486,272
2Mar 18, 2026 20:214,26360,545,09034,373,0001,010,0002,502,656
3Mar 18, 2026 20:214,27657,941,85134,475,0001,013,0002,273,280
4Mar 18, 2026 20:214,29261,658,77234,610,0001,017,0002,273,280
5Mar 18, 2026 20:214,31964,396,76234,850,000995,0002,494,464
6Mar 18, 2026 20:214,32157,095,49933,871,0001,992,0002,486,272