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 listMar 18, 2026 20:10Joel SmithJoel SmithScore: 2,068,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 20:102,066,62817,186,223,82217,089,043,00063,973,0002,269,184
2Mar 18, 2026 20:102,067,40317,195,251,35717,097,476,00061,969,0002,289,664
3Mar 18, 2026 20:102,067,67617,194,602,45617,103,736,00057,971,0002,277,376
4Mar 18, 2026 20:102,067,80517,197,022,19117,097,813,00064,968,0002,265,088
5Mar 18, 2026 20:102,068,22717,202,307,62217,107,309,00058,976,0002,277,376
6Mar 18, 2026 20:102,068,56217,202,509,43017,108,093,00060,975,0002,277,376
7Mar 18, 2026 20:102,069,11117,206,217,75817,103,654,00069,969,0002,277,376
8Mar 18, 2026 20:102,069,43617,210,269,52717,103,348,00072,967,0002,277,376
9Mar 18, 2026 20:102,069,48717,209,250,62917,113,769,00062,969,0002,277,376