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 7, 2026 20:47janwwwjanwwwScore: 88,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 20:4888,5912,746,458,390653,449,00081,857,0002,117,632
2Oct 7, 2026 20:4888,6252,747,617,359654,081,00081,507,0002,117,632
3Oct 7, 2026 20:4888,6472,746,846,420653,216,00082,556,0002,117,632
4Oct 7, 2026 20:4888,6542,747,229,178654,139,00081,695,0002,117,632
5Oct 7, 2026 20:4888,6742,747,243,947653,407,00082,593,0002,117,632
6Oct 7, 2026 20:4888,7522,747,873,188655,064,00081,578,0002,117,632
7Oct 7, 2026 20:4888,8222,748,645,081653,932,00083,298,0002,117,632
8Oct 7, 2026 20:4888,8642,748,477,465655,235,00082,341,0002,117,632
9Oct 7, 2026 20:4889,0792,750,251,131656,650,00082,711,0002,117,632