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 7, 2026 18:04Alexander StanovoyAlexander StanovoyScore: 44,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:0442,594363,144,976352,268,0001,268,0002,113,536
2Jul 7, 2026 18:0443,549371,077,016360,394,0001,065,0002,113,536
3Jul 7, 2026 18:0443,553371,167,161360,492,0001,005,0002,113,536
4Jul 7, 2026 18:0444,045375,848,557364,553,0001,023,0002,113,536
5Jul 7, 2026 18:0444,170376,294,040365,598,0001,020,0002,113,536
6Jul 7, 2026 18:0444,173376,278,575365,640,0001,004,0002,113,536
7Jul 7, 2026 18:0444,181376,401,536365,704,0001,002,0002,113,536
8Jul 7, 2026 18:0444,183376,481,648365,648,0001,074,0002,113,536
9Jul 7, 2026 18:0444,205376,517,868365,830,0001,076,0002,113,536