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 19, 2025 10:08Brandon TangBrandon TangScore: 389,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 10:08389,1133,261,844,8913,156,694,00072,946,0002,510,848
2Mar 19, 2025 10:08389,1633,253,040,3643,158,096,00071,956,0002,281,472
3Mar 19, 2025 10:08389,2213,261,635,8113,167,565,00062,971,0002,281,472
4Mar 19, 2025 10:08389,4213,257,896,0993,157,234,00074,958,0002,281,472
5Mar 19, 2025 10:08389,7813,262,154,9203,154,231,00080,954,0002,281,472
6Mar 19, 2025 10:08390,2573,262,879,8733,173,168,00065,961,0002,281,472
7Mar 19, 2025 10:08391,1233,270,494,5673,176,355,00069,963,0002,510,848
8Mar 19, 2025 10:08393,0033,298,419,8163,185,953,00075,975,0002,289,664
9Mar 19, 2025 10:08394,1233,296,261,8003,204,234,00066,983,0002,506,752