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 23:55Josu San MartinJosu San MartinScore: 7,989Success
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 23:567,94475,282,20657,202,0008,741,0002,113,536
2Jul 3, 2026 23:567,96475,380,87756,528,0009,581,0002,113,536
3Jul 3, 2026 23:567,96875,452,06257,642,0008,499,0002,113,536
4Jul 3, 2026 23:567,97575,501,49157,544,0008,653,0002,113,536
5Jul 3, 2026 23:567,98975,909,47357,763,0008,551,0002,113,536
6Jul 3, 2026 23:567,99775,702,52356,928,0009,448,0002,113,536
7Jul 3, 2026 23:568,02675,890,61557,899,0008,720,0002,113,536
8Jul 3, 2026 23:568,14677,182,10359,061,0008,556,0002,113,536
9Jul 3, 2026 23:568,15876,993,33459,116,0008,597,0002,113,536