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 5, 2024 10:49Nguyen Thanh VinhNguyen Thanh VinhScore: 69,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 10:4969,527603,742,710520,064,00057,007,0002,281,472
2Nov 5, 2024 10:4969,530598,656,177518,091,00059,010,0002,289,664
3Nov 5, 2024 10:4969,569603,759,295518,382,00059,043,0002,289,664
4Nov 5, 2024 10:4969,571604,576,692510,508,00066,935,0002,289,664
5Nov 5, 2024 10:4969,594607,106,689519,666,00057,962,0002,461,696
6Nov 5, 2024 10:4969,650600,887,846520,086,00058,009,0002,469,888
7Nov 5, 2024 10:4969,652602,671,786524,105,00054,010,0002,473,984
8Nov 5, 2024 10:4969,723603,338,026520,732,00057,970,0002,289,664
9Nov 5, 2024 10:4969,762598,828,807530,022,00049,002,0002,293,760