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 listFeb 18, 2026 19:16Daniel MastalerzDaniel MastalerzScore: 6,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:165,97274,600,48440,465,0009,104,0002,355,200
2Feb 18, 2026 19:166,02173,110,66741,979,0007,996,0002,359,296
3Feb 18, 2026 19:166,06685,899,29841,283,0009,062,0002,396,160
4Feb 18, 2026 19:166,26175,135,31142,974,0008,994,0002,514,944
5Feb 18, 2026 19:166,32980,621,13344,448,0008,081,0002,285,568
6Feb 18, 2026 19:166,46781,808,47443,548,00010,127,0002,445,312