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 3, 2026 21:44Josu San MartinJosu San MartinScore: 22,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 21:4522,163193,368,359182,948,0001,008,0002,113,536
2Jul 3, 2026 21:4522,178193,522,577183,073,0001,007,0002,113,536
3Jul 3, 2026 21:4522,186193,601,221183,144,0001,007,0002,113,536
4Jul 3, 2026 21:4522,188193,611,507183,155,0001,006,0002,113,536
5Jul 3, 2026 21:4522,201193,642,381183,264,0001,006,0002,113,536
6Jul 3, 2026 21:4522,770198,361,643187,984,0001,008,0002,113,536
7Jul 3, 2026 21:4522,796198,708,685188,200,0001,007,0002,113,536
8Jul 3, 2026 21:4522,947199,850,896189,461,0001,006,0002,113,536
9Jul 3, 2026 21:4522,959199,941,068189,559,0001,006,0002,113,536