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 12, 2026 15:31Kevin HeaveyKevin HeaveyScore: 3,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:343,90043,295,30031,357,0001,018,0002,117,632
2Jul 12, 2026 15:343,90342,062,42931,381,0001,022,0002,117,632
3Jul 12, 2026 15:343,90542,010,75831,398,0001,020,0002,117,632
4Jul 12, 2026 15:343,90942,055,30731,426,0001,023,0002,117,632
5Jul 12, 2026 15:343,90942,023,93331,428,0001,020,0002,117,632
6Jul 12, 2026 15:343,91642,165,24031,484,0001,024,0002,117,632
7Jul 12, 2026 15:344,02042,937,42332,157,0001,217,0002,117,632
8Jul 12, 2026 15:344,02442,949,48632,377,0001,029,0002,117,632
9Jul 12, 2026 15:344,05643,330,80632,630,0001,037,0002,117,632