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 06:15Karthik ReddyKarthik ReddyScore: 6,305Success
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 06:156,18261,745,10550,117,0001,198,0002,113,536
2Sep 29, 2026 06:156,18261,651,98750,128,0001,185,0002,113,536
3Sep 29, 2026 06:156,20061,795,22550,255,0001,208,0002,113,536
4Sep 29, 2026 06:156,20161,810,04850,274,0001,199,0002,113,536
5Sep 29, 2026 06:156,30562,724,93251,321,0001,012,0002,113,536
6Sep 29, 2026 06:156,30562,753,41251,309,0001,023,0002,113,536
7Sep 29, 2026 06:156,30562,742,40451,323,0001,012,0002,113,536
8Sep 29, 2026 06:156,30762,768,35151,342,0001,014,0002,113,536
9Sep 29, 2026 06:156,31262,811,72751,372,0001,022,0002,113,536