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:47nnScore: 359,797Success
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:47358,3673,003,506,3082,909,477,00064,966,0002,281,472
2Apr 26, 2025 01:47358,5993,004,837,4412,905,411,00070,961,0002,355,200
3Apr 26, 2025 01:47359,2213,006,698,7052,922,566,00058,971,0002,351,104
4Apr 26, 2025 01:47359,6933,016,386,7762,922,488,00062,967,0002,281,472
5Apr 26, 2025 01:47359,7973,015,485,7292,925,353,00060,965,0002,355,200
6Apr 26, 2025 01:47360,9803,024,257,2612,938,172,00057,963,0002,285,568
7Apr 26, 2025 01:47362,9563,042,228,8382,960,562,00051,974,0002,359,296
8Apr 26, 2025 01:47363,9893,054,751,1852,949,155,00071,954,0002,285,568
9Apr 26, 2025 01:47370,6453,100,988,5213,006,390,00069,962,0002,281,472