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 10, 2026 18:58Sergey SerebryakovSergey SerebryakovScore: 7,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:587,59286,038,31061,012,0002,000,0002,265,088
2Mar 10, 2026 18:587,60292,341,23060,094,0003,004,0002,273,280
3Mar 10, 2026 18:587,60686,704,68361,123,0002,004,0002,404,352
4Mar 10, 2026 18:587,95391,214,04065,014,0001,000,0002,400,256
5Mar 10, 2026 18:587,95789,884,71165,040,0001,000,0002,265,088
6Mar 10, 2026 18:587,95799,976,43564,045,0002,001,0002,265,088