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 listJan 5, 2026 21:18lipapipalipapipaScore: 65,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 21:1864,414559,116,950468,679,00065,954,000303,104
2Jan 5, 2026 21:1864,450561,338,528467,943,00066,991,000303,104
3Jan 5, 2026 21:1864,477562,166,364466,271,00068,892,000176,128
4Jan 5, 2026 21:1865,684573,971,340471,286,00073,888,0002,404,352
5Jan 5, 2026 21:1865,728576,371,968475,729,00069,813,000311,296
6Jan 5, 2026 21:1865,841573,985,331470,554,00075,928,000299,008
7Jan 5, 2026 21:1865,862575,197,450470,842,00075,813,000176,128
8Jan 5, 2026 21:1865,880573,828,850471,830,00074,973,0002,400,256
9Jan 5, 2026 21:1865,930580,018,386477,316,00069,899,0002,400,256