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 listAug 27, 2026 07:11Victor MerckléVictor MerckléScore: 18,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 07:1118,301160,294,123150,829,0001,075,0002,113,536
2Aug 27, 2026 07:1118,301160,291,476150,886,0001,013,0002,113,536
3Aug 27, 2026 07:1118,302160,300,278150,898,0001,016,0002,113,536
4Aug 27, 2026 07:1118,305160,298,455150,902,0001,036,0002,113,536
5Aug 27, 2026 07:1118,306160,908,992150,890,0001,055,0002,113,536
6Aug 27, 2026 07:1118,318160,439,245151,034,0001,013,0002,113,536
7Aug 27, 2026 07:1118,332160,638,710151,067,0001,096,0002,113,536
8Aug 27, 2026 07:1118,332160,557,490151,092,0001,070,0002,113,536
9Aug 27, 2026 07:1118,562162,537,170153,011,0001,058,0002,113,536