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 23, 2025 21:25alfaixalfaixScore: 71,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 21:2571,421616,254,380590,795,0001,999,0002,281,472
2Feb 23, 2025 21:2571,463615,947,429591,142,0002,000,0002,277,376
3Feb 23, 2025 21:2571,498616,752,671590,438,0002,997,0002,375,680