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:30lipapipalipapipaScore: 6,263Success
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:306,16379,075,64848,142,0003,008,0002,383,872
2Feb 19, 2026 07:306,19874,879,55751,447,00002,371,584
3Feb 19, 2026 07:306,24386,325,11449,825,0001,993,0002,453,504
4Feb 19, 2026 07:306,26380,136,12748,981,0002,998,0002,338,816
5Feb 19, 2026 07:306,34480,059,89250,627,0002,025,0002,322,432
6Feb 19, 2026 07:306,37773,700,54648,932,0003,994,0002,510,848