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 listApr 6, 2026 09:41Danylo MocherniukDanylo MocherniukScore: 8,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 09:428,17390,939,25665,843,0001,995,0002,293,760
2Apr 6, 2026 09:428,17394,749,78765,841,0001,995,0002,514,944
3Apr 6, 2026 09:428,17493,650,30066,848,000997,0002,293,760
4Apr 6, 2026 09:418,17595,734,13465,859,0001,995,0002,510,848
5Apr 6, 2026 09:428,18291,453,67966,914,000998,0002,293,760
6Apr 6, 2026 09:428,18790,691,60066,954,000999,0002,514,944
7Apr 6, 2026 09:428,18789,808,22365,958,0001,998,0002,510,848
8Apr 6, 2026 09:418,19195,974,14065,988,0001,999,0002,293,760
9Apr 6, 2026 09:418,19394,604,71466,001,0002,000,0002,510,848