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 16, 2026 18:47KacpxerKacpxerScore: 5,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:475,77258,673,83745,766,0002,142,0002,113,536
2Oct 16, 2026 18:475,83659,184,42646,289,0002,156,0002,113,536
3Oct 16, 2026 18:475,84959,317,38846,303,0002,251,0002,113,536
4Oct 16, 2026 18:475,86859,445,86746,568,0002,139,0002,113,536
5Oct 16, 2026 18:475,99960,563,61347,616,0002,181,0002,113,536
6Oct 16, 2026 18:477,14969,947,43057,209,0002,130,0002,113,536
7Oct 16, 2026 18:477,26670,900,53558,186,0002,126,0002,113,536
8Oct 16, 2026 18:477,44072,365,25159,634,0002,125,0002,113,536
9Oct 16, 2026 18:477,48072,695,05259,992,0002,098,0002,113,536