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 14, 2026 23:44Tomislav TunkovicTomislav TunkovicScore: 7,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:447,37769,691,74559,960,0001,270,0002,117,632
2Aug 14, 2026 23:447,37769,723,17159,981,0001,253,0002,117,632
3Aug 14, 2026 23:447,37769,643,46259,997,0001,239,0002,117,632
4Aug 14, 2026 23:447,38069,745,44460,018,0001,236,0002,117,632
5Aug 14, 2026 23:447,38169,767,66060,028,0001,240,0002,117,632
6Aug 14, 2026 23:447,38769,734,60560,060,0001,255,0002,117,632
7Aug 14, 2026 23:447,38869,791,88460,033,0001,294,0002,117,632
8Aug 14, 2026 23:447,39069,777,20060,082,0001,258,0002,117,632
9Aug 14, 2026 23:447,40669,978,25460,453,0001,019,0002,117,632