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:22KacpxerKacpxerScore: 7,638Success
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:237,48271,696,00660,996,0001,111,0002,117,632
2Oct 16, 2026 18:237,53474,086,45861,268,0001,272,0002,117,632
3Oct 16, 2026 18:237,61372,272,11261,945,0001,251,0002,117,632
4Oct 16, 2026 18:237,63472,408,38562,276,0001,087,0002,117,632
5Oct 16, 2026 18:237,63872,475,21262,304,0001,098,0002,117,632
6Oct 16, 2026 18:237,69472,865,43362,763,0001,099,0002,117,632
7Oct 16, 2026 18:237,71473,123,33662,929,0001,103,0002,117,632
8Oct 16, 2026 18:237,81073,872,70163,730,0001,099,0002,117,632
9Oct 16, 2026 18:237,83974,122,01963,966,0001,102,0002,117,632