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 16:32Sergey SerebryakovSergey SerebryakovScore: 8,905Success
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 16:328,48894,474,43069,443,0001,006,0002,387,968
2Mar 10, 2026 16:328,49594,616,33970,507,00002,387,968
3Mar 10, 2026 16:328,53697,101,77468,854,0001,995,0002,269,184
4Mar 10, 2026 16:328,90598,094,79371,916,0001,997,0002,387,968
5Mar 10, 2026 16:328,908101,818,61972,937,000999,0002,269,184
6Mar 10, 2026 16:328,92995,492,56572,109,0002,003,0002,383,872