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 28, 2026 19:54Victor MerckléVictor MerckléScore: 44,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 19:5644,868380,313,854371,406,0001,003,0002,117,632stderr
2Jun 28, 2026 19:5644,883380,227,185371,465,0001,067,0002,117,632stderr
3Jun 28, 2026 19:5644,896380,282,106371,522,0001,120,0002,117,632stderr
4Jun 28, 2026 19:5644,913380,433,584371,651,0001,127,0002,117,632stderr
5Jun 28, 2026 19:5644,938380,770,052371,913,0001,073,0002,117,632stderr
6Jun 28, 2026 19:5644,978381,112,905372,316,0001,004,0002,117,632stderr
7Jun 28, 2026 19:5645,092381,990,631373,270,0001,001,0002,117,632stderr
8Jun 28, 2026 19:5645,112382,188,880373,300,0001,132,0002,117,632stderr
9Jun 28, 2026 19:5645,135382,282,255373,567,0001,054,0002,117,632stderr