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 00:12Victor MerckléVictor MerckléScore: 7,402Success
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 00:137,29968,960,36059,468,0001,115,0002,117,632stderr
2Aug 25, 2026 00:137,35769,453,52059,921,0001,149,0002,117,632stderr
3Aug 25, 2026 00:137,38869,807,61760,312,0001,014,0002,117,632stderr
4Aug 25, 2026 00:137,39969,785,89160,335,0001,081,0002,117,632stderr
5Aug 25, 2026 00:137,40269,849,50260,351,0001,092,0002,117,632stderr
6Aug 25, 2026 00:137,40769,904,33860,467,0001,012,0002,117,632stderr
7Aug 25, 2026 00:137,44370,794,50960,707,0001,071,0002,117,632stderr
8Aug 25, 2026 00:137,53170,975,97761,429,0001,080,0002,117,632stderr
9Aug 25, 2026 00:137,61271,593,28762,116,0001,069,0002,117,632stderr