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 8, 2026 20:15Victor MerckléVictor MerckléScore: 43,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:1842,934364,898,915355,200,0001,157,0002,117,632stderr
2Sep 8, 2026 20:1842,968365,176,877355,529,0001,112,0002,117,632stderr
3Sep 8, 2026 20:1843,010366,309,359355,916,0001,070,0002,117,632stderr
4Sep 8, 2026 20:1843,049366,551,544356,160,0001,147,0002,117,632stderr
5Sep 8, 2026 20:1843,083366,206,743356,495,0001,101,0002,117,632stderr
6Sep 8, 2026 20:1843,135366,558,739356,906,0001,121,0002,117,632stderr
7Sep 8, 2026 20:1843,146367,382,923357,070,0001,047,0002,117,632stderr
8Sep 8, 2026 20:1843,157367,379,836357,058,0001,149,0002,117,632stderr
9Sep 8, 2026 20:1843,247368,022,775357,785,0001,169,0002,117,632stderr