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 27, 2025 19:26Oleg KovalovOleg KovalovScore: 50,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 19:2650,360440,424,291415,989,0001,999,0002,289,664
2Jan 27, 2025 19:2650,388441,141,287416,219,0002,001,0002,289,664
3Jan 27, 2025 19:2650,396443,013,703416,289,0002,001,0002,277,376
4Jan 27, 2025 19:2650,424448,063,335417,515,0001,001,0002,269,184
5Jan 27, 2025 19:2650,436442,283,056416,622,0001,998,0002,289,664
6Jan 27, 2025 19:2650,445442,321,450417,694,000999,0002,269,184
7Jan 27, 2025 19:2650,482443,046,477417,004,0002,000,0002,273,280
8Jan 27, 2025 19:2650,509444,890,762418,222,0001,000,0002,523,136
9Jan 27, 2025 19:2650,623446,989,302419,167,0001,000,0002,375,680