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 24, 2026 21:32Karthik ReddyKarthik ReddyScore: 20,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 21:3220,417179,774,543168,458,0001,009,0002,113,536
2Sep 24, 2026 21:3220,447180,043,858168,704,0001,011,0002,113,536
3Sep 24, 2026 21:3220,485180,323,501169,021,0001,011,0002,113,536
4Sep 24, 2026 21:3220,544180,844,733169,512,0001,011,0002,113,536
5Sep 24, 2026 21:3220,549180,820,072169,553,0001,009,0002,113,536
6Sep 24, 2026 21:3220,564180,990,316169,678,0001,010,0002,113,536
7Sep 24, 2026 21:3220,638181,519,617170,288,0001,010,0002,113,536
8Sep 24, 2026 21:3220,638181,599,821170,290,0001,012,0002,113,536
9Sep 24, 2026 21:3220,686182,016,334170,693,0001,009,0002,113,536