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 27, 2026 20:42BrillentypBrillentypScore: 389,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 20:42387,0633,238,992,4563,129,662,00082,964,0002,289,664
2Mar 27, 2026 20:42388,0363,243,812,3033,159,727,00060,975,0002,285,568
3Mar 27, 2026 20:42388,3103,249,853,8703,155,015,00067,957,0002,281,472
4Mar 27, 2026 20:42388,8353,259,937,0483,160,383,00066,944,0002,281,472
5Mar 27, 2026 20:42389,7463,263,031,1133,161,940,00072,952,0002,281,472
6Mar 27, 2026 20:42389,9923,264,258,4543,170,980,00065,957,0002,281,472
7Mar 27, 2026 20:42391,2703,272,545,7223,182,572,00064,970,0002,351,104
8Mar 27, 2026 20:42391,6123,275,743,5033,180,418,00069,965,0002,465,792
9Mar 27, 2026 20:42404,2433,382,508,8703,290,252,00064,965,0002,281,472