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 6, 2026 15:15Josu San MartinJosu San MartinScore: 5,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 15:155,13669,344,31942,628,00002,289,664
2Mar 6, 2026 15:155,15968,955,01941,827,000995,0002,289,664
3Mar 6, 2026 15:155,16667,724,34040,882,0001,994,0002,363,392
4Mar 6, 2026 15:155,26269,677,94042,656,0001,015,0002,371,584
5Mar 6, 2026 15:155,31573,216,51642,107,0002,005,0002,281,472
6Mar 6, 2026 15:155,32166,376,20443,162,0001,003,0002,486,272
7Mar 6, 2026 15:155,32470,948,26043,188,0001,004,0002,367,488
8Mar 6, 2026 15:155,32963,890,05542,220,0002,010,0002,289,664
9Mar 6, 2026 15:155,35364,223,40544,432,00002,371,584
10Mar 6, 2026 15:155,35869,277,85543,461,0001,010,0002,289,664
11Mar 6, 2026 15:155,43969,203,16544,141,0001,003,0002,465,792
12Mar 6, 2026 15:155,47870,984,70044,461,0001,010,0002,289,664