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 listNov 1, 2026 19:39ambarish1729ambarish1729Score: 15,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:4115,216137,135,908115,572,00010,724,0002,113,536
2Nov 1, 2026 19:4115,225137,768,451115,549,00010,821,0002,113,536
3Nov 1, 2026 19:4115,298137,756,615116,572,00010,405,0002,113,536
4Nov 1, 2026 19:4115,481140,658,695115,443,00013,054,00020,480
5Nov 1, 2026 19:4115,538139,763,438115,892,00013,076,00020,480
6Nov 1, 2026 19:4115,640140,644,905116,556,00013,258,00020,480
7Nov 1, 2026 19:4115,734141,484,379115,921,00014,672,0002,113,536
8Nov 1, 2026 19:4115,906142,937,640115,896,00016,125,0002,113,536
9Nov 1, 2026 19:4116,931163,124,086123,501,00017,034,0002,117,632