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 19:24KacpxerKacpxerScore: 6,239Success
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 19:256,12661,377,92049,782,0001,069,0002,113,536
2Oct 16, 2026 19:256,14461,463,43349,964,0001,037,0002,113,536
3Oct 16, 2026 19:256,22062,066,13050,577,0001,050,0002,113,536
4Oct 16, 2026 19:256,23662,243,69750,636,0001,124,0002,113,536
5Oct 16, 2026 19:256,23962,227,11950,759,0001,031,0002,113,536
6Oct 16, 2026 19:256,26962,454,47050,991,0001,043,0002,113,536
7Oct 16, 2026 19:256,27462,494,07850,955,0001,122,0002,113,536
8Oct 16, 2026 19:256,29662,778,72251,148,0001,112,0002,113,536
9Oct 16, 2026 19:256,33663,167,59251,544,0001,053,0002,113,536