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 listFeb 19, 2026 07:55lipapipalipapipaScore: 6,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 07:556,05374,145,01347,225,0003,014,0002,338,816
2Feb 19, 2026 07:556,05576,295,51149,248,0001,005,0002,461,696
3Feb 19, 2026 07:556,07781,066,67949,428,0001,008,0002,347,008
4Feb 19, 2026 07:556,12380,584,36348,832,0001,993,0002,449,408
5Feb 19, 2026 07:556,13277,176,94347,904,0002,994,0002,506,752
6Feb 19, 2026 07:556,13374,877,24948,911,0001,996,0002,306,048
7Feb 19, 2026 07:556,15974,380,34748,113,0003,007,0002,371,584
8Feb 19, 2026 07:556,19076,181,11949,366,0002,014,0002,375,680
9Feb 19, 2026 07:556,25579,964,01749,922,0001,996,0002,297,856
10Feb 19, 2026 07:556,31273,877,55750,376,0002,015,0002,449,408
11Feb 19, 2026 07:556,33776,718,92252,600,00002,367,488
12Feb 19, 2026 07:556,50973,642,22451,025,0003,001,0002,461,696