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 9, 2026 18:22plklaplklaScore: 64,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:2264,485556,577,427534,222,0001,000,0002,277,376
2Jan 9, 2026 18:2264,496568,099,424535,316,00002,273,280
3Jan 9, 2026 18:2264,500566,938,844534,350,0001,000,0002,396,160
4Jan 9, 2026 18:2264,507563,547,375534,404,0001,000,0002,277,376
5Jan 9, 2026 18:2264,510566,913,765534,439,000998,0002,408,448
6Jan 9, 2026 18:2264,525560,620,841534,558,000999,0002,400,256
7Jan 9, 2026 18:2264,529559,462,083533,589,0001,998,0002,277,376
8Jan 9, 2026 18:2264,535563,916,604533,639,0001,998,0002,277,376
9Jan 9, 2026 18:2264,546557,929,396533,736,0001,999,0002,277,376