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 listFeb 11, 2026 18:13olliecrowolliecrowScore: 6,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:135,91079,425,45148,052,0001,001,0002,314,240
2Feb 11, 2026 18:135,94077,154,49247,290,0002,012,0002,519,040
3Feb 11, 2026 18:136,13176,407,23548,896,0001,995,0002,383,872
4Feb 11, 2026 18:136,25882,837,52147,943,0003,995,0002,519,040
5Feb 11, 2026 18:136,36477,450,43248,835,0003,986,0002,322,432
6Feb 11, 2026 18:136,54880,430,09751,333,0003,019,0002,478,080