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 17, 2026 22:47Sergey SerebryakovSergey SerebryakovScore: 6,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 22:476,84383,750,55354,808,0001,993,0002,445,312
2Mar 17, 2026 22:476,84480,219,41254,810,0001,993,0002,531,328
3Mar 17, 2026 22:476,84581,319,70355,816,000996,0002,277,376
4Mar 17, 2026 22:476,84580,771,90154,817,0001,993,0002,527,232
5Mar 17, 2026 22:476,84682,155,33454,830,0001,993,0002,445,312
6Mar 17, 2026 22:476,84980,615,26954,851,0001,994,0002,445,312
7Mar 17, 2026 22:476,84983,677,05054,851,0001,994,0002,445,312
8Mar 17, 2026 22:476,84981,298,15255,846,000997,0002,277,376
9Mar 17, 2026 22:476,94682,702,53855,665,0001,988,0002,441,216