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 listJul 5, 2026 20:53Kevin HeaveyKevin HeaveyScore: 4,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:564,61247,838,12537,119,0001,168,0002,117,632
2Jul 5, 2026 20:564,65548,183,92737,392,0001,251,0002,117,632
3Jul 5, 2026 20:564,80649,483,44138,648,0001,247,0002,117,632
4Jul 5, 2026 20:564,84949,843,98739,011,0001,242,0002,117,632
5Jul 5, 2026 20:564,85549,832,10039,029,0001,272,0002,117,632
6Jul 5, 2026 20:564,86949,997,44939,262,0001,154,0002,117,632
7Jul 5, 2026 20:564,87250,001,50539,159,0001,282,0002,117,632
8Jul 5, 2026 20:564,98350,881,42540,206,0001,155,0002,117,632
9Jul 5, 2026 20:565,09651,875,66341,015,0001,290,0002,117,632