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 29, 2026 18:06Karthik ReddyKarthik ReddyScore: 3,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 18:073,63840,553,15829,176,0001,021,0002,113,536
2Sep 29, 2026 18:073,65740,720,37729,242,0001,112,0002,113,536
3Sep 29, 2026 18:073,66240,873,82129,288,0001,111,0002,113,536
4Sep 29, 2026 18:073,66440,781,70429,303,0001,116,0002,113,536
5Sep 29, 2026 18:073,66740,878,41729,342,0001,101,0002,113,536
6Sep 29, 2026 18:073,69941,025,77929,595,0001,107,0002,113,536
7Sep 29, 2026 18:073,70741,191,36329,658,0001,117,0002,113,536
8Sep 29, 2026 18:073,71341,226,37029,715,0001,107,0002,113,536
9Sep 29, 2026 18:073,77541,757,09930,293,0001,043,0002,113,536