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 14, 2026 21:01Kevin HeaveyKevin HeaveyScore: 3,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:023,68640,244,37729,576,0001,023,0002,117,632
2Jul 14, 2026 21:023,68741,647,16929,579,0001,026,0002,117,632
3Jul 14, 2026 21:023,69240,240,70229,622,0001,025,0002,117,632
4Jul 14, 2026 21:023,70040,457,82829,689,0001,026,0002,117,632
5Jul 14, 2026 21:023,70340,377,50529,709,0001,026,0002,117,632
6Jul 14, 2026 21:023,71440,507,36229,804,0001,028,0002,117,632
7Jul 14, 2026 21:023,78041,064,73530,333,0001,043,0002,117,632
8Jul 14, 2026 21:023,79841,062,10030,486,0001,044,0002,117,632
9Jul 14, 2026 21:023,83250,684,99130,764,0001,046,0002,121,728