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 17, 2026 09:22eeby jeebyeeby jeebyScore: 21,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 09:2221,280186,971,249175,620,0001,006,0002,113,536
2Sep 17, 2026 09:2221,293187,098,922175,731,0001,005,0002,113,536
3Sep 17, 2026 09:2221,320187,253,633175,954,0001,005,0002,113,536
4Sep 17, 2026 09:2221,345187,502,735176,162,0001,006,0002,113,536
5Sep 17, 2026 09:2221,349188,803,385176,196,0001,008,0002,113,536
6Sep 17, 2026 09:2221,452188,473,591177,052,0001,006,0002,113,536
7Sep 17, 2026 09:2221,519189,885,111177,607,0001,007,0002,113,536
8Sep 17, 2026 09:2221,580190,250,407178,113,0001,005,0002,113,536
9Sep 17, 2026 09:2221,767191,023,405179,662,0001,005,0002,113,536