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 19, 2026 06:39Genos0Genos0Score: 63,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 06:3963,401556,980,369525,229,0001,000,0002,371,584
2Mar 19, 2026 06:3963,420556,537,709525,385,0001,000,0002,506,752
3Mar 19, 2026 06:3963,440557,439,944525,555,000999,0002,363,392
4Mar 19, 2026 06:3963,448552,981,495524,617,0001,998,0002,359,296
5Mar 19, 2026 06:3963,448552,113,135522,622,0003,997,0002,363,392
6Mar 19, 2026 06:3963,461554,139,670524,727,0001,998,0002,510,848
7Mar 19, 2026 06:3963,465553,308,542525,763,000999,0002,359,296
8Mar 19, 2026 06:3963,476553,254,802523,853,0002,999,0002,363,392
9Mar 19, 2026 06:3963,480552,242,570524,886,0001,999,0002,502,656