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 13:20George SeabridgeGeorge SeabridgeScore: 7,453Success
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 13:217,18969,636,10358,666,0001,008,0002,113,536
2Aug 1, 2026 13:217,22569,928,74758,889,0001,083,0002,113,536
3Aug 1, 2026 13:217,26070,231,62159,175,0001,083,0002,113,536
4Aug 1, 2026 13:217,36571,082,33160,130,0001,005,0002,113,536
5Aug 1, 2026 13:217,45371,827,29760,766,0001,094,0002,113,536
6Aug 1, 2026 13:218,61081,454,81770,447,0001,021,0002,113,536
7Aug 1, 2026 13:218,61281,462,96070,393,0001,089,0002,113,536
8Aug 1, 2026 13:218,66782,033,59570,859,0001,082,0002,113,536
9Aug 1, 2026 13:218,75482,677,56171,571,0001,091,0002,113,536