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 18, 2026 10:08Joel ChongJoel ChongScore: 49,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:0849,564439,527,303411,381,00002,285,568
2Mar 18, 2026 10:0849,618434,974,973409,832,0001,999,0002,519,040
3Mar 18, 2026 10:0849,664436,655,932411,211,0001,000,0002,265,088
4Mar 18, 2026 10:0849,682433,712,854411,359,0001,000,0002,285,568
5Mar 18, 2026 10:0849,710436,330,168410,599,0001,998,0002,285,568
6Mar 18, 2026 10:0849,712440,682,423411,609,000999,0002,285,568
7Mar 18, 2026 10:0849,772436,505,601411,105,0002,000,0002,285,568
8Mar 18, 2026 10:0849,795440,230,499412,301,0001,000,0002,265,088
9Mar 18, 2026 10:0850,003440,247,261413,024,0002,000,0002,265,088