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 15, 2026 17:08Jonathan GopelJonathan GopelScore: 62,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 17:0962,774543,067,144463,019,00058,002,0002,289,664
2Jan 15, 2026 17:0962,817551,885,507458,335,00063,046,0002,301,952
3Jan 15, 2026 17:0962,857544,890,030459,749,00061,966,0002,293,760
4Jan 15, 2026 17:0862,899549,064,979470,053,00052,005,0002,289,664
5Jan 15, 2026 17:0962,924548,604,578463,240,00059,030,0002,301,952
6Jan 15, 2026 17:0962,943546,780,554455,374,00067,055,0002,420,736
7Jan 15, 2026 17:0962,961548,966,097462,622,00059,951,0002,289,664
8Jan 15, 2026 17:0962,964552,798,946455,656,00066,949,0002,306,048
9Jan 15, 2026 17:0962,995548,410,173459,875,00062,982,0002,289,664
10Jan 15, 2026 17:0963,047549,443,470463,259,00060,033,0002,289,664
11Jan 15, 2026 17:0863,102552,771,816467,774,00055,972,0002,281,472
12Jan 15, 2026 17:0863,245552,929,085469,836,00055,098,0002,314,240