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 listSep 8, 2026 01:46Victor MerckléVictor MerckléScore: 68,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 01:4967,703570,585,488560,800,0001,142,0002,117,632stderr
2Sep 8, 2026 01:4967,841571,646,858561,948,0001,136,0002,117,632stderr
3Sep 8, 2026 01:4968,019573,697,648563,473,0001,092,0002,117,632stderr
4Sep 8, 2026 01:4968,022573,094,790563,522,0001,064,0002,117,632stderr
5Sep 8, 2026 01:4968,071573,482,111563,871,0001,123,0002,117,632stderr
6Sep 8, 2026 01:4968,123573,911,671564,364,0001,059,0002,117,632stderr
7Sep 8, 2026 01:4968,130574,031,136564,364,0001,117,0002,117,632stderr
8Sep 8, 2026 01:4968,178574,400,702564,833,0001,048,0002,117,632stderr
9Sep 8, 2026 01:4968,205574,573,082564,921,0001,188,0002,117,632stderr