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 listJan 12, 2026 18:55Alexander FrolovAlexander FrolovScore: 25,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 18:5525,407234,106,573208,882,0001,998,0002,486,272
2Jan 12, 2026 18:5525,413237,324,888208,927,0001,999,0002,277,376
3Jan 12, 2026 18:5525,413235,474,522208,925,0001,999,0002,482,176
4Jan 12, 2026 18:5525,421232,090,491208,998,0001,999,0002,277,376
5Jan 12, 2026 18:5525,425232,725,552209,028,0002,000,0002,494,464
6Jan 12, 2026 18:5525,437233,518,302209,124,0002,001,0002,494,464
7Jan 12, 2026 18:5525,440233,524,124210,156,0001,000,0002,277,376
8Jan 12, 2026 18:5525,445233,179,603210,191,0001,000,0002,494,464
9Jan 12, 2026 18:5525,501232,656,911210,659,000998,0002,482,176