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 24, 2026 13:17wnwnScore: 5,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 13:214,79548,425,69627,119,00012,681,00020,480
2Sep 24, 2026 13:215,11051,923,18727,962,00014,453,00020,480
3Sep 24, 2026 13:215,13851,374,82528,345,00014,305,0002,113,536
4Sep 24, 2026 13:215,15051,341,86028,274,00014,474,00020,480
5Sep 24, 2026 13:215,32253,055,09826,792,00017,387,0002,113,536
6Sep 24, 2026 13:215,35053,000,68326,939,00017,467,0002,113,536
7Sep 24, 2026 13:215,35153,738,86027,828,00016,593,0002,113,536
8Sep 24, 2026 13:215,46153,979,44527,092,00018,241,0002,113,536
9Sep 24, 2026 13:216,15359,737,75727,700,00023,377,00020,480