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 listOct 28, 2024 18:20ndrenndrenScore: 243,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:20243,5242,043,878,0431,950,276,00070,973,0002,285,568
2Oct 28, 2024 18:20243,6702,054,298,5531,954,517,00067,948,0002,289,664
3Oct 28, 2024 18:20243,7252,047,202,3051,957,953,00064,965,0002,281,472
4Oct 28, 2024 18:20243,8082,056,103,2671,949,656,00073,949,0002,281,472
5Oct 28, 2024 18:20243,8082,055,433,8381,966,648,00056,960,0002,289,664
6Oct 28, 2024 18:20243,8202,046,301,2471,954,750,00068,955,0002,281,472
7Oct 28, 2024 18:20243,9052,051,345,9171,962,430,00061,982,0002,285,568
8Oct 28, 2024 18:20243,9812,054,608,4131,974,067,00050,975,0002,289,664
9Oct 28, 2024 18:20244,3742,057,617,1541,963,327,00064,977,0002,269,184