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 30, 2026 18:47Karthik ReddyKarthik ReddyScore: 26,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:4826,047225,120,552188,795,00027,402,0002,117,632
2Sep 30, 2026 18:4826,050225,109,433189,022,00027,197,0002,117,632
3Sep 30, 2026 18:4826,070225,376,526189,093,00027,290,0002,117,632
4Sep 30, 2026 18:4826,077225,363,378188,940,00027,506,0002,117,632
5Sep 30, 2026 18:4826,095225,535,903188,945,00027,644,0002,117,632
6Sep 30, 2026 18:4826,095225,491,053189,110,00027,483,0002,117,632
7Sep 30, 2026 18:4826,206227,246,629188,774,00028,739,0002,117,632
8Sep 30, 2026 18:4826,267226,921,603188,911,00029,111,0002,117,632
9Sep 30, 2026 18:4826,424228,287,766188,903,00030,420,0002,117,632