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:14Yuriy LyfenkoYuriy LyfenkoScore: 4,456Success
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:144,43864,180,06435,840,000995,0002,535,424
2Apr 19, 2026 05:144,45661,390,54634,984,0001,999,0002,301,952
3Apr 19, 2026 05:144,48556,924,06235,217,0002,012,0002,535,424