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 listJun 17, 2026 21:36Victor MerckléVictor MerckléScore: 17,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 21:3617,712154,381,416145,972,0001,038,0002,113,536
2Jun 17, 2026 21:3617,724154,571,435146,063,0001,053,0002,113,536
3Jun 17, 2026 21:3617,725154,884,752145,994,0001,128,0002,113,536
4Jun 17, 2026 21:3617,728154,666,430146,125,0001,018,0002,113,536
5Jun 17, 2026 21:3617,732154,683,015146,152,0001,030,0002,113,536
6Jun 17, 2026 21:3617,737154,649,128146,110,0001,113,0002,113,536
7Jun 17, 2026 21:3617,738154,967,852146,108,0001,123,0002,113,536
8Jun 17, 2026 21:3617,754155,407,853146,329,0001,034,0002,113,536
9Jun 17, 2026 21:3617,946156,386,293147,885,0001,069,0002,113,536