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:46George SeabridgeGeorge SeabridgeScore: 7,944Success
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,91676,347,78364,615,0001,091,0002,113,536
2Aug 2, 2026 12:467,91876,997,10464,628,0001,097,0002,113,536
3Aug 2, 2026 12:467,92575,777,34764,675,0001,109,0002,113,536
4Aug 2, 2026 12:467,93876,565,43664,804,0001,087,0002,113,536
5Aug 2, 2026 12:467,94475,900,08064,838,0001,102,0002,113,536
6Aug 2, 2026 12:467,94775,882,70064,872,0001,093,0002,113,536
7Aug 2, 2026 12:467,96075,941,83064,983,0001,092,0002,113,536
8Aug 2, 2026 12:468,10377,176,41166,168,0001,090,0002,113,536
9Aug 2, 2026 12:468,12777,391,26666,365,0001,090,0002,113,536