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 listMar 23, 2026 20:09Elijah KinElijah KinScore: 47,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 20:0947,433420,160,386391,692,0001,998,0002,265,088
2Mar 23, 2026 20:0947,436418,722,533392,716,000999,0002,260,992
3Mar 23, 2026 20:0947,437420,420,910391,732,0001,998,0002,523,136
4Mar 23, 2026 20:0947,445419,907,524392,796,000999,0002,523,136
5Mar 23, 2026 20:0947,450425,717,288391,838,0001,999,0002,383,872
6Mar 23, 2026 20:0947,453421,443,629391,861,0001,999,0002,519,040
7Mar 23, 2026 20:0947,464421,346,906391,954,0001,999,0002,265,088
8Mar 23, 2026 20:0947,470421,330,315391,999,0001,999,0002,375,680
9Mar 23, 2026 20:0947,478419,475,369392,068,0002,000,0002,265,088