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 12, 2026 13:10Sergey SerebryakovSergey SerebryakovScore: 7,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:107,60288,923,78262,098,0001,001,0002,273,280
2Mar 12, 2026 13:107,60586,454,36661,115,0002,003,0002,404,352
3Mar 12, 2026 13:107,64492,638,74163,449,00002,387,968
4Mar 12, 2026 13:107,96787,964,34464,127,0002,003,0002,273,280
5Mar 12, 2026 13:107,98487,762,75665,263,0001,004,0002,273,280
6Mar 12, 2026 13:108,00788,062,34165,451,0001,006,0002,404,352