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 1, 2026 10:46George SeabridgeGeorge SeabridgeScore: 7,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:466,67063,879,53354,341,0001,021,0002,117,632
2Aug 1, 2026 10:466,69064,028,88254,529,0001,005,0002,117,632
3Aug 1, 2026 10:467,88973,946,05364,473,0001,009,0002,117,632
4Aug 1, 2026 10:467,89373,969,03164,505,0001,007,0002,117,632
5Aug 1, 2026 10:467,90175,945,03264,396,0001,186,0002,117,632
6Aug 1, 2026 10:467,91374,268,17864,673,0001,010,0002,117,632
7Aug 1, 2026 10:467,91774,155,24464,706,0001,006,0002,117,632
8Aug 1, 2026 10:467,92274,281,85964,745,0001,008,0002,117,632
9Aug 1, 2026 10:467,93674,356,53864,867,0001,007,0002,117,632