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 07:13Daniel MastalerzDaniel MastalerzScore: 5,861Success
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 07:135,76775,495,78344,871,0002,991,0002,424,832
2Mar 12, 2026 07:135,81671,267,91945,257,0003,017,0002,416,640
3Mar 12, 2026 07:135,85674,618,20346,576,0002,025,0002,285,568
4Mar 12, 2026 07:135,86173,822,21446,620,0002,026,0002,416,640
5Mar 12, 2026 07:135,89973,402,24546,963,0001,998,0002,285,568
6Mar 12, 2026 07:135,92273,500,85346,147,0003,009,0002,285,568