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 listJul 19, 2026 19:09Ondřej PolaneckýOndřej PolaneckýScore: 7,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 19:097,21369,498,52953,627,0006,248,0002,117,632
2Jul 19, 2026 19:097,25569,853,94653,434,0006,790,0002,113,536
3Jul 19, 2026 19:097,26669,993,71353,479,0006,834,0002,113,536
4Jul 19, 2026 19:097,27270,014,20153,611,0006,754,0002,113,536
5Jul 19, 2026 19:097,29470,071,93553,513,0007,034,0002,113,536
6Jul 19, 2026 19:097,32270,331,48354,026,0006,752,0002,113,536
7Jul 19, 2026 19:097,33770,360,13554,348,0006,556,0002,113,536
8Jul 19, 2026 19:097,33970,574,53053,982,0006,936,0002,113,536
9Jul 19, 2026 19:097,39270,867,95054,541,0006,814,0002,113,536