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 25, 2025 23:16Giacomo StevanatoGiacomo StevanatoScore: 29,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 23:1629,142267,655,520240,881,000999,0002,363,392
2Jan 25, 2025 23:1629,179266,563,749242,186,00002,285,568
3Jan 25, 2025 23:1629,207266,011,399241,420,0001,001,0002,363,392