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 10, 2024 19:41Serge SmirnovSerge SmirnovScore: 28,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 19:4128,938268,260,448238,182,0002,001,0002,293,760
2Nov 10, 2024 19:4128,940269,942,804238,200,0002,001,0002,527,232
3Nov 10, 2024 19:4128,941263,145,211238,207,0002,001,0002,277,376
4Nov 10, 2024 19:4128,941263,562,007238,206,0002,001,0002,289,664
5Nov 10, 2024 19:4128,947266,191,715239,262,0001,001,0002,523,136
6Nov 10, 2024 19:4128,949260,437,760238,274,0002,002,0002,367,488
7Nov 10, 2024 19:4128,973276,577,331239,471,0001,001,0002,531,328
8Nov 10, 2024 19:4128,977264,553,307238,510,0001,995,0002,293,760
9Nov 10, 2024 19:4129,001267,111,761238,712,0001,997,0002,285,568