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 listNov 2, 2025 03:39Tan Lip WeiTan Lip WeiScore: 39,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 03:4039,866356,798,402319,892,00010,996,0002,265,088
2Nov 2, 2025 03:3939,877361,663,043319,984,00010,999,0002,260,992
3Nov 2, 2025 03:3939,919361,452,032319,353,00011,975,0002,498,560
4Nov 2, 2025 03:3939,929357,913,215319,429,00011,978,0002,269,184
5Nov 2, 2025 03:4039,947356,157,559321,570,0009,986,0002,347,008
6Nov 2, 2025 03:4039,957364,148,671321,653,0009,989,0002,269,184
7Nov 2, 2025 03:4039,961361,697,346322,684,0008,991,0002,519,040
8Nov 2, 2025 03:3939,975359,493,746321,801,0009,993,0002,379,776
9Nov 2, 2025 03:4040,000365,724,388323,001,0009,000,0002,441,216
10Nov 2, 2025 03:3940,049362,535,396321,427,00010,980,0002,383,872
11Nov 2, 2025 03:4040,102366,938,978321,849,00010,994,0002,277,376
12Nov 2, 2025 03:3940,147364,527,676320,211,00013,008,0002,260,992