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 23, 2026 17:26Victor MerckléVictor MerckléScore: 3,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:273,74039,427,36329,938,0001,112,0002,117,632stderr
2Aug 23, 2026 17:273,77939,740,35530,256,0001,114,0002,117,632stderr
3Aug 23, 2026 17:273,78740,434,92830,266,0001,167,0002,117,632stderr
4Aug 23, 2026 17:273,80939,987,61030,537,0001,082,0002,117,632stderr
5Aug 23, 2026 17:273,83040,123,60430,683,0001,112,0002,117,632stderr
6Aug 23, 2026 17:273,83140,410,10730,630,0001,169,0002,117,632stderr
7Aug 23, 2026 17:273,83340,181,23130,658,0001,157,0002,117,632stderr
8Aug 23, 2026 17:273,87740,687,05831,117,0001,068,0002,117,632stderr
9Aug 23, 2026 17:274,16443,601,11533,513,0001,050,0002,117,632stderr