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 12, 2026 05:00Victor MerckléVictor MerckléScore: 77,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:0177,104648,414,829634,477,0005,487,0002,117,632stderr
2Aug 12, 2026 05:0177,196649,096,445635,420,0005,307,0002,117,632stderr
3Aug 12, 2026 05:0177,473651,528,150637,616,0005,418,0002,117,632stderr
4Aug 12, 2026 05:0177,642652,920,022638,763,0005,671,0002,117,632stderr
5Aug 12, 2026 05:0177,932655,262,347641,518,0005,318,0002,117,632stderr
6Aug 12, 2026 05:0177,954655,557,311641,402,0005,617,0002,117,632stderr
7Aug 12, 2026 05:0177,997655,737,148641,890,0005,491,0002,117,632stderr
8Aug 12, 2026 05:0178,013656,022,909642,025,0005,485,0002,117,632stderr
9Aug 12, 2026 05:0178,025656,981,761641,601,0006,014,0002,117,632stderr