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 12:33George SeabridgeGeorge SeabridgeScore: 6,890Success
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 12:336,81167,320,06255,459,0001,079,0002,113,536
2Aug 1, 2026 12:336,81566,587,21755,482,0001,087,0002,113,536
3Aug 1, 2026 12:336,81966,587,57355,509,0001,092,0002,113,536
4Aug 1, 2026 12:336,83266,666,68555,627,0001,081,0002,113,536
5Aug 1, 2026 12:336,89067,195,51256,100,0001,088,0002,113,536
6Aug 1, 2026 12:337,53272,570,86961,363,0001,158,0002,113,536
7Aug 1, 2026 12:338,13877,592,18966,460,0001,091,0002,113,536
8Aug 1, 2026 12:338,15477,623,61766,590,0001,090,0002,113,536
9Aug 1, 2026 12:338,16577,784,42366,675,0001,100,0002,113,536