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 listMay 29, 2025 12:58GabriellaGabriellaScore: 61,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:5861,622543,620,470509,462,0002,001,0002,428,928
2May 29, 2025 12:5861,625539,602,614509,490,0001,998,0002,433,024
3May 29, 2025 12:5861,630539,181,207509,534,0001,998,0002,424,832
4May 29, 2025 12:5861,638540,535,275510,593,000999,0002,428,928
5May 29, 2025 12:5861,639540,226,985510,605,000999,0002,531,328
6May 29, 2025 12:5861,640536,800,200509,612,0001,998,0002,527,232
7May 29, 2025 12:5861,641534,774,001508,624,0002,997,0002,510,848
8May 29, 2025 12:5861,642540,391,016510,626,000999,0002,428,928
9May 29, 2025 12:5861,692538,516,125509,040,0003,000,0002,428,928