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 listApr 29, 2026 12:53TudyMTudyMScore: 34,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 12:5434,720305,709,977287,178,0001,000,0002,441,216
2Apr 29, 2026 12:5434,723305,793,082287,207,0001,000,0002,318,336
3Apr 29, 2026 12:5434,725304,057,565286,220,0002,001,0002,387,968
4Apr 29, 2026 12:5434,732303,867,286285,279,0003,002,0002,379,776
5Apr 29, 2026 12:5434,736308,508,001287,315,0001,001,0002,387,968
6Apr 29, 2026 12:5434,741302,915,510287,357,0001,001,0002,306,048
7Apr 29, 2026 12:5434,746311,066,139287,395,0001,001,0002,371,584
8Apr 29, 2026 12:5434,748305,522,822287,412,0001,001,0002,318,336
9Apr 29, 2026 12:5434,749306,406,730287,421,0001,001,0002,379,776