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 18, 2026 18:58Adam FolwarcznyAdam FolwarcznyScore: 61,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:5861,453519,903,074509,058,0001,003,0002,113,536
2Jul 18, 2026 18:5861,515520,496,224509,572,0001,004,0002,113,536
3Jul 18, 2026 18:5861,516520,768,770509,581,0001,002,0002,113,536
4Jul 18, 2026 18:5861,524521,069,905509,649,0001,003,0002,113,536
5Jul 18, 2026 18:5861,527520,521,750509,680,0001,002,0002,113,536
6Jul 18, 2026 18:5861,532520,553,514508,681,0002,042,0002,113,536
7Jul 18, 2026 18:5861,533520,531,528509,724,0001,004,0002,113,536
8Jul 18, 2026 18:5861,536520,582,263509,754,0001,002,0002,113,536
9Jul 18, 2026 18:5861,566521,419,562508,874,0002,125,0002,113,536