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 12, 2026 12:46boop34boop34Score: 21,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 12:4621,594189,518,519178,227,0001,010,0002,113,536
2Jul 12, 2026 12:4621,950191,924,762181,176,0001,010,0002,113,536
3Jul 12, 2026 12:4621,957192,003,702181,237,0001,009,0002,113,536
4Jul 12, 2026 12:4621,957192,033,253181,238,0001,011,0002,113,536
5Jul 12, 2026 12:4621,959192,036,070181,255,0001,011,0002,113,536
6Jul 12, 2026 12:4621,961192,695,266181,271,0001,010,0002,113,536
7Jul 12, 2026 12:4621,963192,125,603181,289,0001,012,0002,113,536
8Jul 12, 2026 12:4621,968192,590,771181,324,0001,011,0002,113,536
9Jul 12, 2026 12:4622,045192,734,361181,970,0001,010,0002,113,536