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 17:15George SeabridgeGeorge SeabridgeScore: 8,135Success
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 17:178,01476,607,55264,318,0002,204,0002,113,536
2Aug 2, 2026 17:178,03776,605,68164,466,0002,249,0002,113,536
3Aug 2, 2026 17:178,07676,985,27864,792,0002,244,0002,113,536
4Aug 2, 2026 17:178,11278,013,19965,096,0002,241,0002,113,536
5Aug 2, 2026 17:178,13578,109,91665,297,0002,229,0002,113,536
6Aug 2, 2026 17:178,28178,682,31966,588,0002,151,0002,113,536
7Aug 2, 2026 17:178,40780,379,13367,570,0002,215,0002,113,536
8Aug 2, 2026 17:178,42580,611,99767,713,0002,222,0002,113,536
9Aug 2, 2026 17:178,45380,832,51067,972,0002,190,0002,113,536