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 29, 2026 21:10Danylo MocherniukDanylo MocherniukScore: 6,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:106,64081,484,24453,112,0002,004,0002,293,760
2Mar 29, 2026 21:106,64475,995,60253,137,0002,005,0002,322,432
3Mar 29, 2026 21:106,64778,973,44654,168,0001,003,0002,293,760
4Mar 29, 2026 21:106,66674,909,60653,315,0002,011,0002,330,624
5Mar 29, 2026 21:106,68381,579,91353,449,0002,016,0002,506,752
6Mar 29, 2026 21:106,69385,031,79854,541,0001,010,0002,506,752
7Mar 29, 2026 21:106,69988,831,16754,592,0001,010,0002,293,760
8Mar 29, 2026 21:106,72884,017,68553,846,0001,994,0002,293,760
9Mar 29, 2026 21:106,72983,545,16353,856,0001,994,0002,293,760