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 2, 2026 12:45George SeabridgeGeorge SeabridgeScore: 7,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:467,90575,551,14864,521,0001,094,0002,113,536
2Aug 2, 2026 12:467,91475,609,33164,594,0001,098,0002,113,536
3Aug 2, 2026 12:467,92375,679,83064,671,0001,091,0002,113,536
4Aug 2, 2026 12:467,92876,534,21464,705,0001,099,0002,113,536
5Aug 2, 2026 12:467,92976,068,66164,728,0001,088,0002,113,536
6Aug 2, 2026 12:467,93876,581,21264,792,0001,095,0002,113,536
7Aug 2, 2026 12:467,94075,857,08264,809,0001,100,0002,113,536
8Aug 2, 2026 12:468,03676,955,09965,585,0001,120,0002,113,536
9Aug 2, 2026 12:468,06677,626,83965,875,0001,081,0002,113,536