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 26, 2025 01:28nnScore: 365,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 01:28361,6113,028,989,4582,940,403,00060,966,0002,281,472
2Apr 26, 2025 01:28361,7303,026,336,3662,937,392,00064,964,0002,359,296
3Apr 26, 2025 01:28363,5083,044,028,3452,949,135,00067,980,0002,285,568
4Apr 26, 2025 01:28363,6173,044,100,3802,967,056,00050,966,0002,289,664
5Apr 26, 2025 01:28365,2173,061,834,4442,953,344,00077,956,0002,281,472
6Apr 26, 2025 01:28368,6563,093,242,9672,994,869,00064,975,0002,285,568
7Apr 26, 2025 01:28382,1593,197,456,6853,104,940,00066,977,0002,289,664
8Apr 26, 2025 01:28391,2693,269,807,2583,175,565,00071,967,0002,281,472
9Apr 26, 2025 01:28409,4223,430,431,1453,329,242,00068,963,0002,281,472