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 26, 2026 21:47Daniel MastalerzDaniel MastalerzScore: 5,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:475,45269,557,28244,244,0001,005,0002,502,656
2Feb 26, 2026 21:475,45766,775,20643,284,0002,013,0002,289,664
3Feb 26, 2026 21:475,47970,932,11144,465,0001,010,0002,502,656
4Feb 26, 2026 21:475,56668,445,61544,187,0002,008,0002,285,568
5Feb 26, 2026 21:475,57168,426,63944,229,0002,010,0002,506,752
6Feb 26, 2026 21:475,59271,013,57444,395,0002,017,0002,285,568