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 16:23Giacomo StevanatoGiacomo StevanatoScore: 31,399Success
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 16:2331,369284,583,486259,365,0001,001,0002,359,296
2Jan 25, 2025 16:2331,385286,848,008260,492,00002,289,664
3Jan 25, 2025 16:2331,389284,411,916259,523,0001,002,0002,289,664
4Jan 25, 2025 16:2331,397287,559,329259,589,0001,002,0002,363,392
5Jan 25, 2025 16:2331,399293,753,519260,615,00002,289,664
6Jan 25, 2025 16:2331,412288,525,430258,725,0001,997,0002,363,392
7Jan 25, 2025 16:2331,417287,158,224258,766,0001,998,0002,465,792
8Jan 25, 2025 16:2331,425289,966,873258,830,0001,998,0002,289,664
9Jan 25, 2025 16:2333,158301,362,172274,211,0001,000,0002,289,664