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 10, 2026 09:01wnwnScore: 3,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:023,34435,847,84526,750,0001,011,0002,113,536
2Jul 10, 2026 09:023,34635,769,39726,772,0001,002,0002,113,536
3Jul 10, 2026 09:023,35435,938,99026,818,0001,028,0002,113,536
4Jul 10, 2026 09:023,35535,761,99726,813,0001,035,0002,113,536
5Jul 10, 2026 09:023,36035,915,95526,889,0001,007,0002,113,536
6Jul 10, 2026 09:023,41936,292,31527,338,0001,047,0002,113,536
7Jul 10, 2026 09:023,49137,476,70227,936,0001,044,0002,113,536
8Jul 10, 2026 09:023,51737,689,35828,150,0001,044,0002,113,536
9Jul 10, 2026 09:023,51837,037,11128,184,0001,019,0002,113,536