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 listJun 10, 2026 06:54Victor MerckléVictor MerckléScore: 4,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 06:584,67747,901,32337,565,0001,261,0002,174,976
2Jun 10, 2026 06:584,68447,798,85837,630,0001,250,0002,174,976
3Jun 10, 2026 06:584,68747,924,99537,666,0001,243,0002,174,976
4Jun 10, 2026 06:584,72848,248,55938,003,0001,243,0002,174,976
5Jun 10, 2026 06:584,90249,643,73639,456,0001,238,0002,134,016
6Jun 10, 2026 06:584,90449,781,21739,472,0001,239,0002,129,920
7Jun 10, 2026 06:584,90849,772,93339,471,0001,269,0002,129,920
8Jun 10, 2026 06:584,91249,818,49839,529,0001,243,0002,129,920
9Jun 10, 2026 06:585,16952,000,59941,661,0001,247,0002,129,920