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 listAug 27, 2026 17:10Victor MerckléVictor MerckléScore: 8,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:118,44478,414,48368,048,0002,038,0002,113,536
2Aug 27, 2026 17:118,63980,044,21569,675,0002,036,0002,113,536
3Aug 27, 2026 17:118,72580,707,81870,367,0002,051,0002,113,536
4Aug 27, 2026 17:118,80381,265,03971,064,0002,008,0002,113,536
5Aug 27, 2026 17:118,85181,781,05171,436,0002,028,0002,113,536
6Aug 27, 2026 17:119,05784,273,31973,105,0002,073,0002,113,536
7Aug 27, 2026 17:119,19284,604,63774,263,0002,036,0002,113,536
8Aug 27, 2026 17:119,32385,590,04675,351,0002,038,0002,113,536
9Aug 27, 2026 17:119,37486,128,72975,750,0002,060,0002,113,536