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 04:21wnwnScore: 3,442Success
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 04:223,29035,128,75726,277,0001,034,0002,113,536
2Jul 7, 2026 04:223,29135,331,99926,315,0001,002,0002,113,536
3Jul 7, 2026 04:223,32135,607,21526,556,0001,012,0002,113,536
4Jul 7, 2026 04:223,37135,915,57626,959,0001,025,0002,113,536
5Jul 7, 2026 04:223,44237,198,00727,560,0001,013,0002,113,536
6Jul 7, 2026 04:223,44636,414,16027,580,0001,027,0002,113,536
7Jul 7, 2026 04:223,45036,432,67927,601,0001,037,0002,113,536
8Jul 7, 2026 04:223,49137,500,22327,956,0001,027,0002,113,536
9Jul 7, 2026 04:223,54837,271,18828,447,0001,004,0002,113,536