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 15, 2025 22:43k1k1Score: 485,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 22:43483,1864,039,116,3403,947,465,00062,975,0002,277,376
2Apr 15, 2025 22:43485,6824,059,359,2383,962,193,00068,968,0002,277,376
3Apr 15, 2025 22:43488,8414,085,392,3753,977,414,00079,968,0002,281,472