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 listJul 2, 2026 10:24Arseniy KorobenkoArseniy KorobenkoScore: 391,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:25391,3763,257,888,9383,184,246,00064,175,0002,117,632
2Jul 2, 2026 10:25391,4013,258,109,0553,183,406,00065,224,0002,117,632
3Jul 2, 2026 10:25391,4233,258,784,7733,184,768,00064,049,0002,117,632
4Jul 2, 2026 10:25391,4403,258,509,6303,184,899,00064,057,0002,117,632
5Jul 2, 2026 10:25391,7453,261,465,2563,186,273,00065,214,0002,117,632
6Jul 2, 2026 10:25392,0353,263,935,8083,189,850,00064,047,0002,117,632
7Jul 2, 2026 10:25394,7643,286,232,7473,211,483,00065,063,0002,117,632
8Jul 2, 2026 10:25395,0823,288,981,6963,215,139,00064,045,0002,117,632
9Jul 2, 2026 10:25396,2353,298,492,5723,224,709,00064,047,0002,117,632