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 24, 2026 06:55servant714servant714Score: 56,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:5556,262489,142,751409,976,00056,996,0002,281,472
2Mar 24, 2026 06:5556,341494,591,977411,672,00055,955,0002,273,280
3Mar 24, 2026 06:5556,358494,112,009413,801,00053,974,0002,285,568
4Mar 24, 2026 06:5556,385492,982,923405,995,00061,999,0002,424,832
5Mar 24, 2026 06:5556,423495,300,751409,274,00059,039,0002,428,928
6Mar 24, 2026 06:5556,426491,956,548411,292,00057,040,0002,281,472
7Mar 24, 2026 06:5556,457498,510,438410,647,00057,950,0002,273,280
8Mar 24, 2026 06:5556,459494,786,999411,657,00056,952,0002,281,472
9Mar 24, 2026 06:5556,498491,784,598407,940,00060,991,0002,273,280