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 listOct 19, 2026 19:22DanielDanielScore: 6,159Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:12Andrew Epstein19.34CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 19:226,15361,930,32750,051,0001,019,0002,113,536
2Oct 19, 2026 19:226,15361,884,59650,057,0001,020,0002,113,536
3Oct 19, 2026 19:226,15461,988,98950,059,0001,021,0002,113,536
4Oct 19, 2026 19:226,15762,024,47350,089,0001,022,0002,113,536
5Oct 19, 2026 19:226,15962,014,97550,102,0001,020,0002,113,536
6Oct 19, 2026 19:226,18162,192,26350,285,0001,021,0002,113,536
7Oct 19, 2026 19:226,18262,184,09650,295,0001,020,0002,113,536
8Oct 19, 2026 19:226,44564,382,89852,476,0001,022,0002,113,536
9Oct 19, 2026 19:226,46864,570,27752,670,0001,022,0002,113,536