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 listJan 21, 2025 05:56Rohan KapurRohan KapurScore: 59,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 05:5659,712520,078,435495,609,00002,371,584
2Jan 21, 2025 05:5659,713524,377,249494,616,000999,0002,281,472
3Jan 21, 2025 05:5659,714523,773,097494,631,000999,0002,289,664
4Jan 21, 2025 05:5659,716521,392,216494,641,000999,0002,359,296
5Jan 21, 2025 05:5659,716524,845,261494,644,000999,0002,486,272
6Jan 21, 2025 05:5659,718521,775,230493,659,0001,998,0002,289,664
7Jan 21, 2025 05:5659,720519,367,047493,675,0001,998,0002,289,664
8Jan 21, 2025 05:5659,726521,221,254493,724,0001,998,0002,289,664
9Jan 21, 2025 05:5659,731524,456,136494,769,000999,0002,289,664