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 listMay 14, 2026 08:16Victor MerckléVictor MerckléScore: 58,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:1658,523495,257,379484,569,0001,177,0002,117,632stderr
2May 14, 2026 08:1658,524495,298,437484,722,0001,032,0002,117,632stderr
3May 14, 2026 08:1658,525496,066,933484,648,0001,110,0002,117,632stderr
4May 14, 2026 08:1658,533493,088,732484,709,0001,115,0002,117,632stderr
5May 14, 2026 08:1658,539493,868,309484,752,0001,122,0002,117,632stderr
6May 14, 2026 08:1658,539493,125,094484,847,0001,030,0002,117,632stderr
7May 14, 2026 08:1658,553493,325,418484,938,0001,053,0002,117,632stderr
8May 14, 2026 08:1658,561496,048,151485,037,0001,025,0002,117,632stderr
9May 14, 2026 08:1658,574494,301,248485,046,0001,123,0002,117,632stderr