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 17, 2026 16:25Andrew EpsteinAndrew EpsteinScore: 9,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:389,74389,597,11379,822,0001,050,0002,117,632stderr
2Sep 17, 2026 16:389,74489,669,45679,820,0001,058,0002,117,632stderr
3Sep 17, 2026 16:389,75789,742,81479,935,0001,054,0002,117,632stderr
4Sep 17, 2026 16:389,77389,933,42880,067,0001,054,0002,117,632stderr
5Sep 17, 2026 16:389,77789,895,19780,098,0001,059,0002,117,632stderr
6Sep 17, 2026 16:389,81490,209,78580,411,0001,053,0002,117,632stderr
7Sep 17, 2026 16:389,83091,883,71080,513,0001,084,0002,117,632stderr
8Sep 17, 2026 16:389,83890,452,80180,602,0001,056,0002,117,632stderr
9Sep 17, 2026 16:389,85990,585,10180,776,0001,060,0002,117,632stderr