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 1, 2026 22:17Code HintsCode HintsScore: 10,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:2210,26393,509,15582,938,0002,253,0002,113,536
2Jul 1, 2026 22:2210,43094,352,40784,346,0002,226,0002,113,536
3Jul 1, 2026 22:2210,43894,439,19284,609,0002,027,0002,113,536
4Jul 1, 2026 22:2210,45294,848,34684,490,0002,267,0002,113,536
5Jul 1, 2026 22:2210,50495,122,20484,918,0002,269,0002,113,536
6Jul 1, 2026 22:2210,60595,749,18885,748,0002,277,0002,113,536
7Jul 1, 2026 22:2210,71896,721,83186,734,0002,227,0002,113,536
8Jul 1, 2026 22:2210,78297,561,48087,326,0002,168,0002,113,536
9Jul 1, 2026 22:2211,04099,659,66689,372,0002,268,0002,113,536