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 listFeb 4, 2025 05:14Lickety SplitLickety SplitScore: 77,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 05:1477,380668,835,379641,258,0001,000,0002,322,432
2Feb 4, 2025 05:1477,380673,657,873641,257,0001,000,0002,318,336
3Feb 4, 2025 05:1477,393669,492,621641,361,0001,000,0002,310,144