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 listAug 27, 2026 01:17Victor MerckléVictor MerckléScore: 3,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:173,82340,703,92630,730,0001,009,0002,117,632stderr
2Aug 27, 2026 01:173,82740,116,01830,757,0001,010,0002,117,632stderr
3Aug 27, 2026 01:173,83140,177,78130,796,0001,008,0002,117,632stderr
4Aug 27, 2026 01:173,83340,198,39230,696,0001,121,0002,117,632stderr
5Aug 27, 2026 01:173,83940,236,93030,733,0001,135,0002,117,632stderr
6Aug 27, 2026 01:173,84040,299,86330,854,0001,019,0002,117,632stderr
7Aug 27, 2026 01:173,84240,291,17630,886,0001,010,0002,117,632stderr
8Aug 27, 2026 01:173,84640,209,27030,816,0001,114,0002,117,632stderr
9Aug 27, 2026 01:173,84840,979,95030,928,0001,015,0002,117,632stderr