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 listOct 13, 2026 06:36e1011e1011Score: 57,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:3757,828490,459,194425,726,00054,250,0002,113,536
2Oct 13, 2026 06:3757,829490,650,447425,727,00054,254,0002,113,536
3Oct 13, 2026 06:3757,844491,322,782426,806,00053,305,0002,113,536
4Oct 13, 2026 06:3757,845491,345,050426,803,00053,315,0002,113,536
5Oct 13, 2026 06:3757,859491,433,919425,978,00054,254,0002,113,536
6Oct 13, 2026 06:3757,881491,025,728426,119,00054,299,0002,113,536
7Oct 13, 2026 06:3757,907491,032,829426,311,00054,320,0002,113,536
8Oct 13, 2026 06:3757,910491,869,241426,252,00054,401,0002,113,536
9Oct 13, 2026 06:3757,935491,505,696426,623,00054,241,0002,113,536