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 listSep 29, 2026 17:14parastromparastromScore: 4,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 17:164,14443,369,10733,210,0001,193,0002,113,536
2Sep 29, 2026 17:164,15743,500,60433,317,0001,193,0002,113,536
3Sep 29, 2026 17:164,16643,575,54933,343,0001,235,0002,113,536
4Sep 29, 2026 17:164,17643,582,51333,430,0001,231,0002,113,536
5Sep 29, 2026 17:164,19145,411,87633,574,0001,212,0002,113,536
6Sep 29, 2026 17:164,21444,035,70333,708,0001,271,0002,113,536
7Sep 29, 2026 17:164,22443,882,45434,042,0001,025,0002,113,536
8Sep 29, 2026 17:164,22544,048,69733,814,0001,254,0002,113,536
9Sep 29, 2026 17:164,22944,060,00433,877,0001,225,0002,113,536