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 listSep 23, 2026 07:16Kevin HeaveyKevin HeaveyScore: 3,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:243,32136,428,07026,419,0001,149,0002,113,536
2Sep 23, 2026 07:243,32136,372,44526,373,0001,194,0002,113,536
3Sep 23, 2026 07:243,32636,455,72326,452,0001,154,0002,113,536
4Sep 23, 2026 07:243,33436,482,83826,531,0001,149,0002,113,536
5Sep 23, 2026 07:243,33536,678,42326,484,0001,203,0002,113,536
6Sep 23, 2026 07:243,33738,366,50226,546,0001,152,0002,113,536
7Sep 23, 2026 07:243,34038,920,00726,709,0001,013,0002,113,536
8Sep 23, 2026 07:243,34136,742,89126,567,0001,171,0002,113,536
9Sep 23, 2026 07:243,34137,303,68926,524,0001,208,0002,113,536