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 13, 2026 15:30Dominique GarmierDominique GarmierScore: 8,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:308,21693,315,75767,192,0001,002,0002,289,664
2Mar 13, 2026 15:308,26594,596,57667,594,0001,008,0002,412,544
3Mar 13, 2026 15:308,26991,396,93665,651,0002,984,0002,506,752
4Mar 13, 2026 15:308,29296,829,23166,826,0001,994,0002,408,448
5Mar 13, 2026 15:308,30693,902,51066,938,0001,998,0002,289,664
6Mar 13, 2026 15:308,40791,326,30668,784,000996,0002,281,472
7Mar 13, 2026 15:308,45097,911,54168,128,0002,003,0002,289,664
8Mar 13, 2026 15:308,45296,741,10368,148,0002,004,0002,289,664
9Mar 13, 2026 15:308,477100,927,38068,350,0002,010,0002,408,448