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 listSep 29, 2026 10:57wnwnScore: 3,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:583,28536,066,19027,273,000020,480
2Sep 29, 2026 10:583,28636,187,81727,281,000020,480
3Sep 29, 2026 10:583,29136,192,58127,320,000020,480
4Sep 29, 2026 10:583,29536,254,55027,351,000020,480
5Sep 29, 2026 10:583,30936,354,87927,467,000020,480
6Sep 29, 2026 10:583,30936,197,24527,467,000020,480
7Sep 29, 2026 10:583,31036,357,35127,480,000020,480
8Sep 29, 2026 10:583,31636,360,14027,526,000020,480
9Sep 29, 2026 10:583,43437,384,78828,506,000020,480