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 listMar 18, 2026 06:23Yuriy LyfenkoYuriy LyfenkoScore: 4,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 06:234,72164,747,38637,177,0002,009,0002,531,328
2Mar 18, 2026 06:234,72666,178,17037,215,0002,011,0002,301,952
3Mar 18, 2026 06:234,93069,505,22638,923,0001,996,0002,269,184