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 listOct 28, 2024 18:44RileyRileyScore: 57,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:4457,333506,635,866473,862,0001,999,0002,289,664
2Oct 28, 2024 18:4457,349504,490,510473,994,0001,999,0002,289,664
3Oct 28, 2024 18:4457,354499,149,710474,036,0002,000,0002,289,664
4Oct 28, 2024 18:4457,365504,087,717474,126,0002,000,0002,289,664
5Oct 28, 2024 18:4457,373504,960,716474,193,0002,000,0002,289,664
6Oct 28, 2024 18:4457,375503,977,669475,215,0001,000,0002,265,088
7Oct 28, 2024 18:4457,398507,809,174475,404,0001,000,0002,273,280
8Oct 28, 2024 18:4457,401508,904,386476,431,00002,289,664
9Oct 28, 2024 18:4457,404505,817,309475,456,0001,000,0002,289,664