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 listOct 2, 2026 18:30Karthik ReddyKarthik ReddyScore: 3,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:313,61739,075,59426,286,0003,743,00020,480
2Oct 2, 2026 18:313,61838,997,98226,220,0003,814,00020,480
3Oct 2, 2026 18:313,62139,054,06326,224,0003,835,00020,480
4Oct 2, 2026 18:313,63039,130,74526,157,0003,976,00020,480
5Oct 2, 2026 18:313,63139,232,03926,201,0003,941,00020,480
6Oct 2, 2026 18:313,63439,246,59826,247,0003,919,00020,480
7Oct 2, 2026 18:313,65739,454,80426,472,0003,887,00020,480
8Oct 2, 2026 18:313,66539,485,71426,264,0004,162,00020,480
9Oct 2, 2026 18:313,71039,900,36726,850,0003,951,00020,480