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 listApr 25, 2025 22:56nnScore: 387,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2025 22:56384,0713,214,872,8043,133,807,00053,979,0002,281,472
2Apr 25, 2025 22:56384,6223,216,188,7993,127,399,00064,966,0002,461,696
3Apr 25, 2025 22:56384,8693,219,660,0013,133,440,00060,969,0002,359,296
4Apr 25, 2025 22:56386,7803,238,484,0473,147,309,00062,966,0002,281,472
5Apr 25, 2025 22:56387,0793,241,908,0083,136,784,00075,970,0002,355,200
6Apr 25, 2025 22:56388,2133,251,423,6113,150,208,00071,959,0002,281,472
7Apr 25, 2025 22:56390,5913,272,457,9543,181,945,00059,961,0002,285,568
8Apr 25, 2025 22:56392,1933,280,726,8043,195,239,00059,966,0002,281,472
9Apr 25, 2025 22:56392,6373,290,222,1403,184,939,00073,952,0002,351,104