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 listJul 31, 2026 18:06George SeabridgeGeorge SeabridgeScore: 8,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:068,77982,978,62771,715,0001,158,0002,117,632
2Jul 31, 2026 18:068,81683,391,63372,029,0001,146,0002,117,632
3Jul 31, 2026 18:068,84883,431,60572,256,0001,184,0002,117,632
4Jul 31, 2026 18:068,87583,686,79972,517,0001,151,0002,117,632
5Jul 31, 2026 18:068,90383,887,84872,719,0001,181,0002,117,632
6Jul 31, 2026 18:068,91283,955,65772,802,0001,172,0002,117,632
7Jul 31, 2026 18:068,91783,946,19572,882,0001,136,0002,117,632
8Jul 31, 2026 18:068,95684,347,26773,324,0001,013,0002,117,632
9Jul 31, 2026 18:0610,38696,199,07085,033,0001,172,0002,117,632