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 listMay 14, 2026 08:06Victor MerckléVictor MerckléScore: 59,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:0658,113491,036,123481,305,0001,038,0002,117,632stderr
2May 14, 2026 08:0658,124490,796,653481,394,0001,040,0002,117,632stderr
3May 14, 2026 08:0658,751497,341,114486,635,0001,005,0002,117,632stderr
4May 14, 2026 08:0659,248501,996,176490,706,0001,059,0002,117,632stderr
5May 14, 2026 08:0659,250500,088,938490,712,0001,070,0002,117,632stderr
6May 14, 2026 08:0659,258499,208,218490,702,0001,142,0002,117,632stderr
7May 14, 2026 08:0659,258500,525,730490,715,0001,130,0002,117,632stderr
8May 14, 2026 08:0659,265502,191,237490,868,0001,035,0002,117,632stderr
9May 14, 2026 08:0659,267501,328,500490,748,0001,174,0002,117,632stderr