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 25, 2026 13:17Victor MerckléVictor MerckléScore: 7,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:187,24968,579,88059,161,0001,012,0002,117,632stderr
2Aug 25, 2026 13:187,27268,691,83859,233,0001,125,0002,117,632stderr
3Aug 25, 2026 13:187,28868,921,51259,469,0001,025,0002,117,632stderr
4Aug 25, 2026 13:187,29569,432,66559,416,0001,134,0002,117,632stderr
5Aug 25, 2026 13:187,45970,327,80860,773,0001,137,0002,117,632stderr
6Aug 25, 2026 13:187,52271,499,20961,356,0001,083,0002,117,632stderr
7Aug 25, 2026 13:187,57771,265,73261,835,0001,057,0002,117,632stderr
8Aug 25, 2026 13:187,59971,542,95161,922,0001,156,0002,117,632stderr
9Aug 25, 2026 13:187,63071,735,86862,210,0001,124,0002,117,632stderr