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 listMar 29, 2025 01:49Emanuele BolognesiEmanuele BolognesiScore: 398,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2025 01:49397,4593,333,195,6983,238,929,00059,980,0002,285,568
2Mar 29, 2025 01:49397,6353,324,704,9483,224,406,00075,962,0002,289,664
3Mar 29, 2025 01:49397,9783,328,464,4063,243,231,00059,985,0002,281,472
4Mar 29, 2025 01:49398,7373,337,546,8433,258,541,00050,977,000184,320
5Mar 29, 2025 01:49398,8333,339,177,3273,251,344,00058,969,0002,281,472
6Mar 29, 2025 01:49399,7993,347,723,3353,251,362,00066,966,0002,281,472
7Mar 29, 2025 01:49400,9073,360,776,3563,252,560,00074,966,0002,359,296
8Mar 29, 2025 01:49401,1063,359,934,8923,257,220,00071,960,0002,289,664
9Mar 29, 2025 01:49403,2923,372,731,2043,269,360,00077,960,0002,281,472