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 19, 2026 05:23Yuriy LyfenkoYuriy LyfenkoScore: 4,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 05:234,38363,670,74534,356,0002,020,0002,465,792
2Apr 19, 2026 05:234,38856,872,33135,411,0001,011,0002,469,888
3Apr 19, 2026 05:234,40056,613,02236,519,00002,535,424