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 listAug 11, 2026 11:34Victor MerckléVictor MerckléScore: 5,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:355,83956,850,27346,396,0002,070,0002,117,632stderr
2Aug 11, 2026 11:355,85058,073,31546,493,0002,067,0002,117,632stderr
3Aug 11, 2026 11:355,86556,979,28746,589,0002,091,0002,117,632stderr
4Aug 11, 2026 11:355,86957,084,71346,648,0002,071,0002,117,632stderr
5Aug 11, 2026 11:355,87357,057,01946,688,0002,064,0002,117,632stderr
6Aug 11, 2026 11:355,87557,103,27446,645,0002,124,0002,117,632stderr
7Aug 11, 2026 11:355,88557,246,16946,822,0002,031,0002,117,632stderr
8Aug 11, 2026 11:355,91357,422,33046,974,0002,104,0002,117,632stderr
9Aug 11, 2026 11:355,91657,385,45846,976,0002,128,0002,117,632stderr