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 listApr 29, 2026 13:17TudyMTudyMScore: 34,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:1734,656304,018,626285,652,0001,997,0002,379,776
2Apr 29, 2026 13:1734,660302,777,830283,690,0003,995,0002,306,048
3Apr 29, 2026 13:1734,681309,359,165283,859,0003,998,0002,396,160
4Apr 29, 2026 13:1734,681308,353,305285,855,0001,998,0002,383,872
5Apr 29, 2026 13:1734,683304,200,104284,874,0002,998,0002,375,680
6Apr 29, 2026 13:1734,684305,862,186285,886,0001,999,0002,379,776
7Apr 29, 2026 13:1734,694303,289,714284,969,0002,999,0002,306,048
8Apr 29, 2026 13:1734,695306,891,553285,970,0001,999,0002,371,584
9Apr 29, 2026 13:1734,696306,006,768285,979,0001,999,0002,383,872